Packing Problems Publications

Publications in Packing Problems

Explore the most influential research papers and scholarly works that have shaped Packing Problems. Use the concept filter below to focus on a specific sub-area of research.

Packing Problems

Publications

84.5K

Citations

Showing yearly statistics from 2000-2026.

Page 1

	Year	Citations
An Efficient Heuristic Procedure for Partitioning Graphs Brian W. Kernighan, Shang Min Lin Bell System Technical Journal Cluster ComputingEngineeringNetwork AnalysisEducationArbitrary Graphs	1970	5.2K
A Greedy Heuristic for the Set-Covering Problem Vašek Chvátal Mathematics of Operations Research Mathematical ProgrammingX BinaryTotal UnimodularityEngineeringBinary Matrix	1979	2.5K
The Location of Emergency Service Facilities Constantine Toregas, Ralph W. Swain, Charles ReVelle, Operations Research Mathematical ProgrammingEqual CostsFacility PlanningEngineeringEmergency Management	1971	1.8K
An improved typology of cutting and packing problems Gerhard Wäscher, Heike Haußner, Holger Schumann European Journal of Operational Research Improved TypologyEngineeringDesignCombinatorial ProblemLogistics	2006	1.5K
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS Fred Glover Decision Sciences Mathematical ProgrammingEngineeringSurrogate Constraint ProceduresComputational ComplexityBranch And Cut	1977	1.3K
A Linear Programming Approach to the Cutting Stock Problem—Part II Paul C. Gilmore, Ralph E. Gomory Operations Research Mathematical ProgrammingEngineeringLogistics OptimizationIndustrial EngineeringSmart Manufacturing	1963	1.1K
A typology of cutting and packing problems Harald Dyckhoff European Journal of Operational Research Production PlanningEngineeringDesignCombinatorial ProblemBusiness	1990	1.1K
Selected Topics in Column Generation Marco E. Lübbecke, Jacques Desrosiers Operations Research Mathematical ProgrammingEngineeringBranch And CutText MiningAutomatic Summarization	2005	1.1K
An Algorithm for the Traveling Salesman Problem John D. C. Little, Katta G. Murty, Dura W. Sweeney, Operations Research Mathematical ProgrammingBranch-and-bound AlgorithmHeuristic SearchEngineeringComputational Complexity	1963	1K
Cones of Matrices and Set-Functions and 0–1 Optimization László Lovász, Alexander Schrijver SIAM Journal on Optimization Mathematical ProgrammingEngineeringPlanar GraphComputational ComplexityConvex Hull	1991	1K
Two-dimensional packing problems: A survey Andrea Lodi, Silvano Martello, Michele Monaci European Journal of Operational Research Mathematical ProgrammingDiscrete GeometryEngineeringCombinatorial ProblemComputational Geometry	2002	820
The Lagrangian Relaxation Method for Solving Integer Programming Problems Marshall L. Fisher Management Science Numerical AnalysisMathematical ProgrammingBranch-and-bound AlgorithmEngineeringMinimization Problems	2004	793

Page 1